Incentive Based Cooperation in Multi-Agent Auctions

نویسندگان

  • Charles Pippin
  • Henrik I. Christensen
چکیده

Market or auction based algorithms offer effective methods for de-centralized task assignment in multi-agent teams. Typically there is an implicit assumption that agents are willing to cooperate and can be trusted to perform assigned tasks. Reciprocal collaboration may not always be a valid assumption. In cases where auctions are used for task allocation, without explicit revenue exchange, incentives are needed to enforce cooperation. An approach to incentive based trust is presented, which enables detection of team members that are not contributing and for dynamic formation of teams.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Comparative Study of Multi-Attribute Continuous Double Auction Mechanisms

Auctions have been as a competitive method of buying and selling valuable or rare items for a long time. Single-sided auctions in which participants negotiate on a single attribute (e.g. price) are very popular. Double auctions and negotiation on multiple attributes create more advantages compared to single-sided and single-attribute auctions. Nonetheless, this adds the complexity of the auctio...

متن کامل

A Taxonomy of Incentive Patterns - The Design Space of Incentives for Cooperation

Peer-to-peer systems, multi-agent systems, and ad hoc networks aim at exploiting synergies that result from cooperation. Yet, these systems are composed of autonomous entities that are free to decide whether to cooperate or not. Hence, incentives are indispensable to induce cooperation between autonomous entities. In this paper, we introduce incentive patterns as a means of systematically conce...

متن کامل

Winner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search

A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...

متن کامل

Incentive Compatibility on Multiple Internet Auctions based on Bidding Support Agents

Agent-mediated electronic commerce has recently commanded much attention. We envision a future in which many people trade their goods by using a bidding support agent on Internet auctions. In this paper, we formalize a situation in which people are trading their goods on Internet auctions and employing bidding support agents. Then, we prove that in the above situation all participants need to s...

متن کامل

Incentive Compatibility in Multi-unit Auctions

We characterize incentive compatibility in multi-unit auctions with multi-dimensional types. An allocation mechanism is incentive compatible if and only if it is nondecreasing in marginal utilities (NDMU). The notion of incentive compatibility we adopt is dominant strategy in private value models and ex post incentive compatibility in models with interdependent values. NDMU is the following req...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012